Synchronization invariance under network structural transformations
نویسندگان
چکیده
منابع مشابه
Proof Transformations and Structural Invariance
In this paper we define the concept of a profile, which is a characteristic clause set, corresponding to an LK-proof in first-order logic, which is invariant under rule permutations. It is shown (via cutelimination) that the profile is even invariant under a large class of proof transformations (called “simple transformations”), which includes transformations to negation normal form. As proofs ...
متن کاملNetwork mutual information and synchronization under time transformations
We investigate the effect of general time transformations on the phase synchronization (PS) phenomenon and the mutual information rate (MIR) between pairs of nodes in dynamical networks. We demonstrate two important results concerning the invariance of both PS and the MIR. Under time transformations PS can neither be introduced nor destroyed and the MIR cannot be raised from zero. On the other ...
متن کاملTopological Invariance under Line Graph Transformations
It is shown that the line graph transformation G L(G) of a graph G preserves an isomorphic copy of G as the nerve of a finite simplicial complex K which is naturally associated with the Krausz decomposition of L(G). As a consequence, the homology of K is isomorphic to that of G. This homology invariance algebraically confirms several well known graph theoretic properties of line graphs and fo...
متن کاملInvariance of Poisson measures under random transformations
We prove that Poisson measures are invariant under (random) intensity preserving transformations whose finite difference gradient satisfies a cyclic vanishing condition. The proof relies on moment identities of independent interest for adapted and anticipating Poisson stochastic integrals, and is inspired by the method of Üstünel and Zakai, Probab. Theory Relat. Fields 103, 1995, on the Wiener ...
متن کاملPolicy Invariance under Reward Transformations for General-Sum Stochastic Games
We extend the potential-based shapingmethod fromMarkov decision processes to multi-player general-sum stochastic games. We prove that the Nash equilibria in a stochastic game remains unchanged after potential-based shaping is applied to the environment. The property of policy invariance provides a possible way of speeding convergence when learning to play a stochastic game.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2018
ISSN: 2470-0045,2470-0053
DOI: 10.1103/physreve.97.060301